Bit-string models for parasex
نویسندگان
چکیده
منابع مشابه
Bit-String Models for Parasex
We present different bit-string models of haploid asexual populations in which individuals may exchange part of their genome with other individuals (parasex) according to a given probability. We study the advantages of this parasex concerning population sizes, genetic fitness and diversity. We find that the exchange of genomes always improves these features.
متن کاملAnalytical approach to bit-string models of language evolution
A formulation of bit-string models of language evolution, based on differential equations for the population speaking each language, is introduced and preliminarily studied. Connections with replicator dynamics and diffusion processes are pointed out. The stability of the dominance state, where most of the population speaks a single language, is analyzed within a mean-field-like approximation, ...
متن کاملQuantum bit string commitment.
A bit string commitment protocol securely commits N classical bits so that the recipient can extract only M<N bits of information about the string. Classical reasoning suggests that bit string commitment implies bit commitment and hence, given the Mayers-Lo-Chau theorem, that nonrelativistic quantum bit string commitment is impossible. Not so: there exist nonrelativistic quantum bit string comm...
متن کاملSimple bit-string model for lineage branching.
We introduce a population dynamics model, where individual genomes are represented by bit strings. Selection is described by death probabilities which depend on these genomes, and new individuals continuously replace the ones that die, keeping the population constant. An offspring has the same genome as its (randomly chosen) parent, except for a small amount of (also random) mutations. Chance m...
متن کاملAlternative Algorithms for Bit-Parallel String Matching
We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2003
ISSN: 0378-4371
DOI: 10.1016/s0378-4371(02)01916-7